Determining displacement parameters of “Kletevaya” shaft axis over mined-out space
نویسندگان
چکیده
منابع مشابه
Determining space parameters in systolic array design
This paper addresses the problem of determining geometric and chip area of systolic arrays for one class of nested loop algorithms in advance, before the systolic array synthesis. These parameters are determined only according to a given projection direction and loop boundaries.
متن کاملVisualisation of displacement-distribution parameters in q-space imaging
J. Lätt, S. Brockstedt, R. Wirestam, E. Larsson, F. Ståhlberg Department of Radiation Physics, Lund University, Lund, Sweden, Department of Radiology, Lund University Hospital, Lund, Sweden Synopsis Structural information of the confining geometry of water molecules can be revealed by q-space analysis of highly diffusion encoded images. An advantage of q-space analysis based on high b-values is...
متن کاملAxis I and Axis II diagnostic parameters of homicide.
A series of 100 murderers was examined to discern overall patterns of psychopathology. In addition, demographic and other discriminating factors were used to test the hypothesis that murderers do not constitute a homogenous population and that subgroups will differ diagnostically. DSM-III diagnostic criteria were used to make each diagnosis. The sample was found to be representative of the univ...
متن کاملPlane Strain Deformation of a Poroelastic Half-Space Lying Over Another Poroelastic Half-Space
The plane strain deformation of an isotropic, homogeneous, poroelastic medium caused by an inclined line-load is studied using the Biot linearized theory for fluid saturated porous materials. The analytical expressions for the displacements and stresses in the medium are obtained by applying suitable boundary conditions. The solutions are obtained analytically for the limiting case of undrained...
متن کاملDetermining an Out - of - Core FFT Decomposition
We present an out-of-core FFT algorithm based on the in-core FFT method developed by Swarztrauber. Our algorithm uses a recursive divide-and-conquer strategy, and each stage in the recursion presents several possibilities for how to split the problem into subproblems. We give a recurrence for the algorithm's I/O complexity on the Parallel Disk Model and show how to use dynamic programming to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2018
ISSN: 2267-1242
DOI: 10.1051/e3sconf/20185602008